# -*- coding: UTF-8 -*-
import functools
from typing import List
from leetcode_helper import TestcaseHelper, SolutionBase


class Solution(SolutionBase):
    # 解题的方法，命名和Leetcode的保持一致即可
    def largestSumAfterKNegations(self, nums: List[int], k: int) -> int:
        def compare(x: int, y:int) -> int:
            return abs(x) - abs(y)

        nums.sort(key=functools.cmp_to_key(compare), reverse=True)
        count = 0

        for i in range(len(nums)):
            if nums[i] < 0 and count < k:
                nums[i] = -nums[i]
                count += 1

        if count < k:
            if (k - count) % 2:
                nums[-1] = - nums[-1]

        return sum(nums)


if __name__ == '__main__':
    solution = Solution()

    # 按照leetcode的题目说明，将基本的test case填入
    # 每条case的最后一个元素是正确的结果，即期待的结果
    # 使用元组来保存输入的数据，期待的结果
    testcases = [
        ([-2, 5, 0, 2, -2], 3, 11),
        ([2, -3, -1, 5, -4], 2, 13),
        ([4, 2, 3], 1, 5),
        ([3, -1, 0, 2], 3, 6),
    ]

    for case_item in testcases:
        # 获取测试用的case和期待的执行结果
        input1 = case_item[0]
        input2 = case_item[1]
        expect = case_item[len(case_item) - 1]

        exec_result = solution.largestSumAfterKNegations(input1, input2)

        # 判断执行结果，输出提示信息
        check_result = solution.check_result(expect, exec_result)
        TestcaseHelper.print_case(check_result, case_item, exec_result)

